Efficient algorithm for a quantum analogue of 2-SAT
نویسنده
چکیده
Complexity of a quantum analogue of the satisfiability problem is studied. Quantum k-SAT is a problem of verifying whether there exists a state |Ψ〉 of n qubits such that its k-qubit reduced density matrices have support on prescribed subspaces. We present a classical algorithm solving quantum 2-SAT in a polynomial time. It generalizes the well-known algorithm for the classical 2-SAT. Besides, we show that for any k ≥ 4 quantum k-SAT is complete in the complexity class QMA with one-sided error.
منابع مشابه
Designing a quantum genetic controller for tracking the path of quantum systems
Based on learning control methods and computational intelligence, control of quantum systems is an attractive field of study in control engineering. What is important is to establish control approach ensuring that the control process converges to achieve a given control objective and at the same time it is simple and clear. In this paper, a learning control method based on genetic quantum contr...
متن کاملEstimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm
Ohya and Volovich have been proposed a new quantum computation model with chaos amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper we study the complexity of the SAT algorithm by counting the steps of computation algorithm rigorously, which was mentioned in the paper [1, 2, 3, 5, 7]. For this purpose, we refine the quantum gates treating the SAT pro...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملExperimental realization of a highly structured search algorithm
The highly structured search algorithm proposed by Hogg[Phys.Rev.Lett. 80,2473(1998)] is implemented experimentally for the 1-SAT problem in a single search step by using nuclear magnetic resonance technique with twoqubit sample. It is the first demonstration of the Hogg’s algorithm, and can be readily extended to solving 1-SAT problem for more qubits in one step if the appropriate samples poss...
متن کاملOn preparing ground states of gapped Hamiltonians: An efficient Quantum Lovász Local Lemma
A frustration-free local Hamiltonian has the property that its ground state minimises the energy of all local terms simultaneously. In general, even deciding whether a Hamiltonian is frustration-free is a hard task, as it is closely related to the QMA1-complete quantum satisfiability problem (QSAT) – the quantum analogue of SAT, which is the archetypal NP-complete problem in classical computer ...
متن کامل